The Worst-Case Time Complexity for Generating All Maximal Cliques
نویسندگان
چکیده
We present a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron–Kerbosch algorithm. All the maximal cliques generated are output in a tree-like form. Subsequently, we prove that its worst-case time complexity is O(3n/3) for an n-vertex graph. This is optimal as a function of n, since there exist up to 3n/3 maximal cliques in an n-vertex graph. The algorithm is also demonstrated to run very fast in practice by computational experiments. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Maximal Cliques in Unit Disk Graphs: Polynomial Approximation
We consider the problem of generating all maximal cliques in an unit disk graph. General algorithms to find all maximal cliques are exponential, so we rely on a polynomial approximation. Our algorithm makes use of certain key geographic structures of these graphs. For each edge, we limit the set of vertices that may form cliques with this as the longest edge. We then consider several characteri...
متن کاملListing all maximal cliques in sparse graphs in near-optimal time
The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed-parameter tractable algorithm for enumerating all maximal cliques, parametrized by degeneracy. To achieve this result, we modify the classic Bron–Kerbosch algorithm and show that it runs in time O(dn3d/3). We also pr...
متن کاملPolynomial-Time Solvability of the Maximum Clique Problem
The maximum clique problem is known to be a typical NP-complete problem, and hence it is believed to be impossible to solve it in polynomial-time. So, it is important to know a reasonable sufficient condition under which the maximum clique problem can be proved to be polynomial-time solvable. In this paper, given a graph of vertices and whose maximum degree is , we prove that if is less than or...
متن کاملA note on the problem of reporting maximal cliques
Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper of Bron–Kerbosh [C. Bron, J. Kerbosch, Algorithm 457: Finding all cliques of an undirected graph, Communication of ACM 16 (9) (1973) 575–577], and two papers recently published in TCS, namely that of Tomita et al. [To...
متن کاملExtracting of All Maximal Cliques: Monotone System Approach
NP-complicated problems have been described in the graph theory. An example is the extracting of all maximal cliques from a graph. Many algorithms for solving this problem have been described. However, complexity is linear to the number of maximal cliques. This paper discusses a new approach for extracting maximal cliques, based on the monotone system theory. The complexity of the presented alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 363 شماره
صفحات -
تاریخ انتشار 2004